12 research outputs found

    Enhancing Rice Leaf Disease Classification: A Customized Convolutional Neural Network Approach

    Get PDF
    In modern agriculture, correctly identifying rice leaf diseases is crucial for maintaining crop health and promoting sustainable food production. This study presents a detailed methodology to enhance the accuracy of rice leaf disease classification. We achieve this by employing a Convolutional Neural Network (CNN) model specifically designed for rice leaf images. The proposed method achieved an accuracy of 0.914 during the final epoch, demonstrating highly competitive performance compared to other models, with low loss and minimal overfitting. A comparison was conducted with Transfer Learning Inception-v3 and Transfer Learning EfficientNet-B2 models, and the proposed method showed superior accuracy and performance. With the increasing demand for precision agriculture, models like the proposed one show great potential in accurately detecting and managing diseases, ultimately leading to improved crop yields and ecological sustainability

    Improved Reptile Search Optimization Algorithm using Chaotic map and Simulated Annealing for Feature Selection in Medical Filed

    Get PDF
    The increased volume of medical datasets has produced high dimensional features, negatively affecting machine learning (ML) classifiers. In ML, the feature selection process is fundamental for selecting the most relevant features and reducing redundant and irrelevant ones. The optimization algorithms demonstrate its capability to solve feature selection problems. Reptile Search Algorithm (RSA) is a new nature-inspired optimization algorithm that stimulates Crocodiles’ encircling and hunting behavior. The unique search of the RSA algorithm obtains promising results compared to other optimization algorithms. However, when applied to high-dimensional feature selection problems, RSA suffers from population diversity and local optima limitations. An improved metaheuristic optimizer, namely the Improved Reptile Search Algorithm (IRSA), is proposed to overcome these limitations and adapt the RSA to solve the feature selection problem. Two main improvements adding value to the standard RSA; the first improvement is to apply the chaos theory at the initialization phase of RSA to enhance its exploration capabilities in the search space. The second improvement is to combine the Simulated Annealing (SA) algorithm with the exploitation search to avoid the local optima problem. The IRSA performance was evaluated over 20 medical benchmark datasets from the UCI machine learning repository. Also, IRSA is compared with the standard RSA and state-of-the-art optimization algorithms, including Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Grasshopper Optimization algorithm (GOA) and Slime Mould Optimization (SMO). The evaluation metrics include the number of selected features, classification accuracy, fitness value, Wilcoxon statistical test (p-value), and convergence curve. Based on the results obtained, IRSA confirmed its superiority over the original RSA algorithm and other optimized algorithms on the majority of the medical datasets

    A Modified Coronavirus Herd Immunity Optimizer for the Power Scheduling Problem

    No full text
    The Coronavirus herd immunity optimizer (CHIO) is a new human-based optimization algorithm that imitates the herd immunity strategy to eliminate of the COVID-19 disease. In this paper, the coronavirus herd immunity optimizer (CHIO) is modified to tackle a discrete power scheduling problem in a smart home (PSPSH). PSPSH is a combinatorial optimization problem with NP-hard features. It is a highly constrained discrete scheduling problem concerned with assigning the operation time for smart home appliances based on a dynamic pricing scheme(s) and several other constraints. The primary objective when solving PSPSH is to maintain the stability of the power system by reducing the ratio between average and highest power demand (peak-to-average ratio (PAR)) and reducing electricity bill (EB) with considering the comfort level of users (UC). This paper modifies and adapts the CHIO algorithm to deal with such discrete optimization problems, particularly PSPSH. The adaptation and modification include embedding PSPSH problem-specific operators to CHIO operations to meet the discrete search space requirements. PSPSH is modeled as a multi-objective problem considering all objectives, including PAR, EB, and UC. The proposed method is examined using a dataset that contains 36 home appliances and seven consumption scenarios. The main CHIO parameters are tuned to find their best values. These best values are used to evaluate the proposed method by comparing its results with comparative five metaheuristic algorithms. The proposed method shows encouraging results and almost obtains the best results in all consumption scenarios

    Bare-Bones Based Salp Swarm Algorithm for Text Document Clustering

    No full text
    Text Document Clustering (TDC) is a challenging optimization problem in unsupervised machine learning and text mining. The Salp Swarm Algorithm (SSA) has been found to be effective in solving complex optimization problems. However, the SSA’s exploitation phase requires improvement to solve the TDC problem effectively. In this paper, we propose a new approach, known as the Bare-Bones Salp Swarm Algorithm (BBSSA), which leverages Gaussian search equations, inverse hyperbolic cosine control strategies, and greedy selection techniques to create new individuals and guide the population towards solving the TDC problem. We evaluated the performance of the BBSSA on six benchmark datasets from the text clustering domain and six scientific papers datasets extracted from the top eight UAE universities. The experimental results demonstrate that the BBSSA algorithm outperforms traditional SSA and nine other optimization algorithms. Furthermore, the BBSSA algorithm achieves better results than the five traditional clustering techniques

    Classification of EEG mental tasks using Multi-Objective Flower Pollination Algorithm for Person Identification

    Get PDF
    In the modern life, the authentication technique for any system is considered as one of the most important challenges task which must careful consideration. Therefore, many researchers have developed traditional authentication systems to deal with our digital world. Recently, The Biometric techniques have been successfully provided a high level of authentication, such as fingerprint, face recognition, and voice recognition. In this paper, a new authentication system has been proposed which is based on EEG signals with hybridizing wavelet transform and multi-objective flower pollination algorithm (MOFPA-WT). The main task of MOFPA is to find the optimal WT parameters for EEG signal denoising which can extract unique features form the EEG. The proposed method (MOFPA-WT) tested using a standard EEG database which has five different mental tasks, includes baseline, multiplication, rotation, letter composing, and visual counting. To classify the EEG signals using proposed method four classification methods are applied which are, neural network, decision tree, Naive Bayes, and support vector machine. The performance of the (MOFPA-WT) is evaluated using four criteria: (i) accuracy, (ii) sensitivity, (iii) specificity, (v) false acceptance rate. The experimental results show the (MOFPA-WT) can achieve the highest recognition rates up to 85% using neural network classifier based on visual counting task as well as the EEG_Std feature obtained the highest accuracy compared with others EEG features based on visual counting task

    Digital image watermarking using discrete cosine transformation based linear modulation

    No full text
    Abstract The proportion of multimedia traffic in data networks has grown substantially as a result of advancements in IT. As a result, it's become necessary to address the following challenges in protecting multimedia data: prevention of unauthorized disclosure of sensitive data, in addition to tracking down the leak's origin, making sure no alterations may be made without permission, and safeguarding intellectual property for digital assets. watermarking is a technique developed to combat this issue, which transfer secure data over the network. The main goal of invisible watermarking is a hidden exchange of data and a message from being discovered by a third party. The objective of this work is to develop a digital image watermarking using discrete cosine transformation based linear modulation. This paper proposed an invisible watermarking method for embedding information into the transformation domain for the grey scale images. This method used the embedding of a stego-text into the least significant bit (LSB) of the Discrete Cosine Transformation (DCT) coefficient by using a linear modulation algorithm. Also, a stego-text is embedded with different sizes ten times within images after embedding the stego-image immune to different kinds of attack, such as salt and pepper, rotation, cropping, and JPEG compression with different criteria. The proposed method is tested using four benchmark images. Also, to evaluate the embedding effect, PSNR, NC and BER are calculated. The outcomes show that the proposed approach is practical and robust, where the obtained results are promising and do not raise any suspicion. In addition, it has a large capacity, and its results are imperceptible, especially when 1bit/block is embedded

    Smart home battery for the multi-objective power scheduling problem in a smart home using grey wolf optimizer

    No full text
    Article no. 447The power scheduling problem in a smart home (PSPSH) refers to the timely scheduling operations of smart home appliances under a set of restrictions and a dynamic pricing scheme(s) produced by a power supplier company (PSC). The primary objectives of PSPSH are: (I) minimizing the cost of the power consumed by home appliances, which refers to electricity bills, (II) balance the power consumed during a time horizon, particularly at peak periods, which is known as the peak-to-average ratio, and (III) maximizing the satisfaction level of users. Several approaches have been proposed to address PSPSH optimally, including optimization and non-optimization based approaches. However, the set of restrictions inhibit the approach used to obtain the optimal solutions. In this paper, a new formulation for smart home battery (SHB) is proposed for PSPSH that reduces the effect of restrictions in obtaining the optimal/near-optimal solutions. SHB can enhance the scheduling of smart home appliances by storing power at unsuitable periods and use the stored power at suitable periods for PSPSH objectives. PSPSH is formulated as a multi-objective optimization problem to achieve all objectives simultaneously. A robust swarm-based optimization algorithm inspired by the grey wolf lifestyle called grey wolf optimizer (GWO) is adapted to address PSPSH. GWO has powerful operations managed by its dynamic parameters that maintain exploration and exploitation behavior in search space. Seven scenarios of power consumption and dynamic pricing schemes are considered in the simulation results to evaluate the proposed multi-objective PSPSH using SHB (BMO-PSPSH) approach. The proposed BMO-PSPSH approach’s performance is compared with that of other 17 state-of-the-art algorithms using their recommended datasets and four algorithms using the proposed datasets.[...]Taikomosios informatikos katedraVytauto Didžiojo universiteta

    Lemurs Optimizer: A New Metaheuristic Algorithm for Global Optimization

    No full text
    The Lemur Optimizer (LO) is a novel nature-inspired algorithm we propose in this paper. This algorithm’s primary inspirations are based on two pillars of lemur behavior: leap up and dance hub. These two principles are mathematically modeled in the optimization context to handle local search, exploitation, and exploration search concepts. The LO is first benchmarked on twenty-three standard optimization functions. Additionally, the LO is used to solve three real-world problems to evaluate its performance and effectiveness. In this direction, LO is compared to six well-known algorithms: Salp Swarm Algorithm (SSA), Artificial Bee Colony (ABC), Sine Cosine Algorithm (SCA), Bat Algorithm (BA), Flower Pollination Algorithm (FPA), and JAYA algorithm. The findings show that the proposed algorithm outperforms these algorithms in fourteen standard optimization functions and proves the LO’s robust performance in managing its exploration and exploitation capabilities, which significantly leads LO towards the global optimum. The real-world experimental findings demonstrate how LO may tackle such challenges competitively

    A Modified Coronavirus Herd Immunity Optimizer for the Power Scheduling Problem

    No full text
    The Coronavirus herd immunity optimizer (CHIO) is a new human-based optimization algorithm that imitates the herd immunity strategy to eliminate of the COVID-19 disease. In this paper, the coronavirus herd immunity optimizer (CHIO) is modified to tackle a discrete power scheduling problem in a smart home (PSPSH). PSPSH is a combinatorial optimization problem with NP-hard features. It is a highly constrained discrete scheduling problem concerned with assigning the operation time for smart home appliances based on a dynamic pricing scheme(s) and several other constraints. The primary objective when solving PSPSH is to maintain the stability of the power system by reducing the ratio between average and highest power demand (peak-to-average ratio (PAR)) and reducing electricity bill (EB) with considering the comfort level of users (UC). This paper modifies and adapts the CHIO algorithm to deal with such discrete optimization problems, particularly PSPSH. The adaptation and modification include embedding PSPSH problem-specific operators to CHIO operations to meet the discrete search space requirements. PSPSH is modeled as a multi-objective problem considering all objectives, including PAR, EB, and UC. The proposed method is examined using a dataset that contains 36 home appliances and seven consumption scenarios. The main CHIO parameters are tuned to find their best values. These best values are used to evaluate the proposed method by comparing its results with comparative five metaheuristic algorithms. The proposed method shows encouraging results and almost obtains the best results in all consumption scenarios
    corecore